Relaxing real-time order in opacity and linearizability

نویسندگان

  • Tadeusz Kobus
  • Maciej Kokocinski
  • Pawel T. Wojciechowski
چکیده

In this paper we introduce two families of safety properties: ♦-opacity and ♦linearizability. The new properties relax to various degree the real-time order requirement on transaction execution in opacity and, analogically, the real-time order requirement on operation execution in linearizability. This way we can formalize the guarantees provided by a wide class of strongly consistent replicated systems for which opacity and linearizability are too strong. As an example, we analyze Deferred Update Replication, a well known optimistic concurrency control scheme, and prove it satisfies update-real-time opacity, which allows readonly and aborted transactions to operate on stale (but still consistent) data. We also show the relationship between ♦-opacity and ♦-linearizability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proving Opacity via Linearizability: A Sound and Complete Method

Transactional memory (TM) is a mechanism that manages thread synchronisation on behalf of a programmer so that blocks of code execute with the illusion of atomicity. The main safety criterion for transactional memory is opacity, which defines conditions for serialising concurrent transactions. Verifying opacity is complex because one must not only consider the orderings between fine-grained (an...

متن کامل

Reducing Opacity to Linearizability: A Sound and Complete Method

Transactional memory is a mechanism that manages thread synchronisation on behalf of a programmer so that blocks of code execute with an illusion of atomicity. The main safety criterion for transactional memory is opacity, which defines conditions for serialising concurrent transactions. Proving opacity is complicated because it allows concurrent transactions to observe distinct memory states, ...

متن کامل

Local Linearizability for Concurrent Container-Type Data Structures

The semantics of concurrent data structures is usually given by a sequential specification and a consistency condition. Linearizability is the most popular consistency condition due to its simplicity and general applicability. Nevertheless, for applications that do not require all guarantees offered by linearizability, recent research has focused on improving performance and scalability of conc...

متن کامل

Verifying Opacity of a Transactional Mutex Lock

Software transactional memory (STM) provides programmers with a high-level programming abstraction for synchronization of parallel processes, allowing blocks of codes that execute in an interleaved manner to be treated as an atomic block. This atomicity property is captured by a correctness criterion called opacity. Opacity relates histories of a sequential atomic specification with that of STM...

متن کامل

Normality: A Consistency Condition for Concurrent Objects

Linearizability is a consistency condition for concurrent objects (objects shared by concurrent processes) that exploits the semantics of abstract data types. It provides the illusion that each operation applied by concurrent processes takes eeect instantaneously at some point between the beginning and the end of its execution. When compared with other consistency conditions (such as sequential...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Parallel Distrib. Comput.

دوره 100  شماره 

صفحات  -

تاریخ انتشار 2017